Using variable encodings to compress an input data stream to a compressed output data stream

ABSTRACT

Provided are a computer program product, system, method, and data structure for compressing an input data stream. A determination is made of consecutive data units in the input data stream that match consecutive data units in a history buffer. A copy pointer symbol indicates a copy pointer symbol referencing previously received data units in the history buffer. A determination is made of a relative displacement count in the history buffer at which the number of matching consecutive data units start. A determination is made of a range of relative displacement counts comprising one of a plurality of ranges of displacement counts including the determined relative displacement count. A determination is made of the encoding scheme associated with the determined range. An encoding of the relative displacement count is determined from the determined encoding scheme. The determined encoding of the relative displacement count is indicated in the copy pointer.

RELATED APPLICATIONS

This patent application is a continuation of U.S. patent application Ser. No. 13/188,401, filed on Jul. 21, 2011, which patent application is incorporated herein by reference in its entirety.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a computer program product, system, method, and data structure for using variable encodings to compress an input data stream to a compressed output data stream.

2. Description of the Related Art

Data compression involves converting symbols, including data symbols and control symbols, in an input data stream into a compressed output data stream comprising less data than the input data stream. Control symbols are encoded into the compressed data stream and provide decoding instructions to allow decompression, and may be created by the application program which is compressing data. Examples of control symbols created by the application include an end of record control signal, a file mark, and a dataset boundary. There are other events or controls determined by the compression device, such as when to swap to a given compression scheme, and when to reset the history buffer used to perform compression in a given scheme. The compressing device may decide to create an access point at which compression begins with a reset history buffer using a particular scheme after a dataset boundary is encountered.

One type of encoding technique, Huffman coding, provides a lossless compression algorithm that uses a variable length code table for encoding source symbols where the variable length code table has been derived based on the estimated probability of occurrence for each possible source symbol value to produce encodings of the source symbols.

A streaming lossless data compression algorithm (SLDC) receives an input data stream of control symbols and data symbols and converts strings of consecutive bytes of data symbols into copy pointers and literal data symbols that have fewer bits than the data symbols in the input data stream. The SLDC algorithm is used to compress and decompress data in Linear Tape Open (LTO) magnetic tape cartridges. Details of the SLDC algorithm are described in the Standard ECMA-321 publication “Streaming Lossless Data Compression Algorithm—(SLDC), dated Jun. 1, 2001.

FIG. 1 illustrates a prior art implementation of a literal data symbol 2 that the SLDC algorithm outputs into the compressed data stream if there are no consecutive bytes following a data byte, so that the literal data byte is outputted, uncompressed. The literal data symbol 2 includes a zero bit 4 indicating that the symbol is a literal data symbol followed by the actual, uncompressed, data byte. FIG. 20 illustrates prior art operations to generate the literal for the literal symbol (at block 540) by outputting the unencoded data unit to include in the literal symbol (at block 542).

FIG. 2 illustrates a prior art implementation of a copy pointer symbol 10 that the SLDC algorithm outputs to represent multiple consecutive data bytes that match a same number of consecutive data bytes in the history buffer. The copy pointer symbol 10 includes a one bit 12 indicating that the symbol is a copy pointer, a match count field 14 indicating the number of matching consecutive bytes, and a displacement field 16 indicating an absolute memory address having the history buffer entry including the first byte of the matching consecutive bytes. FIG. 14 illustrates prior art operations to determine the displacement count in the copy pointer symbol by determining (at block 352) the absolute memory address having the entry in the history buffer with the start of the matching consecutive data bytes.

FIG. 3 shows a prior art implementation of a match count table 18 that is used to determine an encoding of a match count value as a number of bits, which indicates the number of matching consecutive bytes. The encoding of the match count value specified in the second column is included in the match count field 14 of the copy pointer symbol 10 being generated to represent the consecutive data bytes.

There is a need in the art to provide techniques to continue to improve the compression realized using compression algorithms, such as SLDC and others.

SUMMARY

Provided are a computer program product, system, method, and data structure for compressing an input data stream. A determination is made of consecutive data units in the input data stream that match consecutive data units in a history buffer. A copy pointer symbol indicates a copy pointer symbol referencing previously received data units in the history buffer. A determination is made of a relative displacement count in the history buffer at which the number of matching consecutive data units start. A determination is made of a range of relative displacement counts comprising one of a plurality of ranges of displacement counts including the determined relative displacement count. A determination is made of the encoding scheme associated with the determined range. An encoding of the relative displacement count is determined from the determined encoding scheme. The determined encoding of the relative displacement count is indicated in the copy pointer.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a prior art implementation of a literal data symbol.

FIG. 2 illustrates a prior art implementation of a copy pointer symbol.

FIG. 3 illustrates a prior art implementation of a match count encoding table.

FIG. 4 illustrates an embodiment of a literal data symbol.

FIG. 5 illustrates an embodiment of a copy pointer symbol.

FIG. 6 illustrates an embodiment of a system in which described embodiments are implemented.

FIGS. 7 and 8 illustrate embodiments of displacement count variable length code tables.

FIG. 9 illustrates an embodiment of a minimum displacement count variable length code table.

FIG. 10 illustrates an embodiment of a match count variable length code table.

FIG. 11 illustrates an embodiment of a literal variable length code table.

FIG. 12 illustrates an embodiment of a control symbol value table.

FIG. 13 illustrates an embodiment of operations to compress symbols in an input data stream.

FIG. 14 illustrates a prior art implementation to determine a displacement count field in a copy pointer symbol.

FIGS. 15, 16, 17, and 18 illustrate embodiments of operations to determine a displacement count field in a copy pointer symbol.

FIG. 19 illustrates an embodiment of operations to determine a match count field in a copy pointer symbol.

FIG. 20 illustrates a prior art implementation to generate the literal field for a literal symbol.

FIG. 21 illustrates an embodiment of operations to generate the literal field for a literal symbol.

FIG. 22 illustrates a computer architecture in which described embodiments may be implemented.

DETAILED DESCRIPTION

Described embodiments generate copy pointer symbols and literal data symbols from data units, such as bytes and symbols, in an input data stream to output into the compressed output data stream using variable length code tables, where the values in the table may be determined using Huffman coding techniques. The data units that are subject to processing in the input data stream may comprise data bytes and control symbols.

FIG. 4 provides an embodiment of a literal data symbol 20 having a literal flag 22, such as a bit having a value of zero, identifying the symbol 20 as a literal symbol and a literal displacement count 24 identifying a location/index in a literal queue having the uncompressed data unit in the input data stream.

FIG. 5 provides an embodiment of a copy pointer symbol 30 having a copy pointer flag 32, such as a bit having a value of 1, identifying the symbol 30 as a copy pointer, a match count encoding 34 comprising an encoding of a number of data units (e.g. bytes) in the input data stream replaced by the copy pointer 30 in the output data stream, and a displacement count encoding 36 comprising an encoding of a relative location in the history buffer at which the consecutive data units start. The fields shown in FIG. 5 may be output in a different order than shown.

FIG. 6 illustrates an embodiment of a system 100 coupled to a computer storage 102. The system 100 includes a compression unit 104 to compress data written to the computer storage 102 and decompress data read from the computer storage 102, an Input/Output (I/O) manager 106 to read and write data to the computer storage 102, and a memory 108. The compression unit 104 includes a compression program 110 to perform compression and decompression operations using a history buffer 112 and literal queue 114 in the memory 108. The history buffer 112 stores incoming data units for compression and decompression, where during compression, input data units are replaced by a copy pointer that references consecutive previously processed data units (e.g. bytes) in the history buffer 112.

The literal queue 114 comprises a data structure storing all possible input data units values to be referenced in the literal displacement count 24 field in the literal data symbol 20 that is output into the compressed data stream. The literal queue 114 may comprise a Most Recently Used (MRU) buffer, such as a content addressable memory (CAM). In one embodiment, where each data unit to be output into the compression stream comprises a byte, the literal queue 16 may be 256 bytes, having one entry for each possible byte value. In this way, the literal data symbol 20 includes an index location into the literal queue 114 instead of the data byte.

The compression unit 104 includes a match count variable length code table 116, a displacement count variable length code table 118, a minimum displacement count variable length code table 120, a literal variable length code table 122, and a control symbol table 124. In certain embodiments, the code tables 116, 118, 120, and 122 may include a prefix indicating a number of following bits used to indicate the values being encoded. In certain embodiments, the variable length code tables 116, 118, 120, 122 may comprise Huffman tables that provide encodings of the values having a smaller average output size, than the unencoded codes, according to a probability distribution of the values realized by the compression algorithm.

The compression program 110 uses tables 116, 118, 120, 122, and 124 when compressing and decompressing symbols. The match count variable length code table 116 is used to encode the match count field 34, which indicates a number of consecutive data units, e.g. bytes, in the input data stream replaced by the copy pointer symbol 30. The displacement count variable length code table 118 is used to encode a relative displacement count in the history buffer 112 having the starting consecutive data unit included in the field 36 (FIG. 5) of the copy pointer symbol 30. The minimum displacement count variable length code table 120 is used to encode a displacement count when there are a minimum number of consecutive data units, such as two bytes, that are only found within a predetermined displacement count, such as within 1024 displacement count values. In certain embodiments, the compression program 110 may only use a copy pointer for a minimum number of consecutive data units, such as two consecutive data units, if the displacement count where the consecutive data units start in the history buffer 112 is within a predetermined displacement count, such as in the first 1024 entries in the history buffer 112. This allows use of a smaller code to represent the displacement count that has a smaller value than the total possible displacement count values for the history buffer 124, e.g. 16 KB or 8 KB.

The literal variable length code table 122 is used to encode the literal displacement count in the literal queue 114 having the literal value to include in the field 24 of a literal data symbol 20. The control symbol table 124 provides values for control symbols that are inserted into the output data stream to allow the compression program 110 to decompress the data symbols.

The computer storage 102 may comprise storage media implemented in one or more storage devices known in the art, such as interconnected hard disk drives (e.g. configured as a DASD, RAID, JBOD, etc.), solid state storage devices (e.g. EEPROM (Electrically Erasable Programmable Read-Only Memory), flash memory, flash disk, storage-class memory (SCM)), electronic memory, magnetic tape media, tape cartridges, etc. In one embodiment, the computer storage 102 may comprise a Linear Tape Open (LTO) tape cartridge. The memory 108 may be comprised of one or more volatile or non-volatile memory devices known in the art.

In FIG. 6, the compression program 110 and I/O manager 106 may comprise software programs in a memory, such as memory 108, which also includes the tables 116, 118, 120, 244, and 124, executed by a processor. In an alternative embodiment, the compression program 110, I/O manager 106, and tables 116, 118, 120, 244, and 124 may be implemented in a hardware component, such as a dedicated integrated circuit, e.g. Application Specific Integrated Circuit (ASIC), expansion card, etc., in the storage server 100 or implemented as a combination of hardware or software.

In one embodiment, the system 100 may comprise a storage drive, such as a tape drive, that interfaces with removable storage 102 units, such as tape cartridges, hard disk drives, flash memory devices, optical storage, etc. In a further embodiment, the system 100 may comprise a host system which interfaces further with a storage drive to interface with computer storage 102.

The compression unit 104 may be designed to perform compression operations as part of an SLDC algorithm that compresses and decompresses data for an LTO tape cartridge.

FIG. 7 illustrates a table 150 comprising an embodiment of the displacement count variable length code table 118 in an embodiment when the history buffer 112 is 16 kilobytes (KB). Table 150 provides different encodings of the relative displacement count into the history buffer 112 for different ranges of displacement counts. In table 150, entry 152 has a first prefix value of 3 bits which indicates that a next following 8 bits indicates a relative displacement count of 0 through 255 in the history buffer 112; entry 154 has a second prefix value of four bits which indicates that a next following 8 bits indicates a relative displacement count of 256 through 511 in the history buffer 112; entry 156 has a third prefix value of four bits which indicates that a next following 9 bits indicates a relative displacement count of 512 through 1023 in the history buffer 112; entry 158 has a fourth prefix value of three bits which indicates that a next following 10 bits indicates a relative displacement count of 1024 through 2047 in the history buffer 112; entry 160 has a fifth prefix value of two bits which indicates that a next following 11 bits indicates a relative displacement count of 2048 through 4095 in the history buffer 112; entry 162 has a sixth prefix value of two bits which indicates that a next following 12 bits indicates a relative displacement count of 4096 through 8191 in the history buffer 112; and entry 164 has a seventh prefix value of 2 bits which indicates that a next following 13 bits indicates a relative displacement count of 8192 through 16385 in the history buffer 112.

FIG. 8 illustrates a table 170 comprising an embodiment of the displacement count variable length code table 118 in an embodiment when the history buffer 112 is 8 kilobytes (KB). Table 170 provides different encodings of the relative displacement count into the history buffer 112 for different ranges of displacement counts. In table 170, entry 172 has a first prefix value of 2 bits which indicates that a next following 8 bits indicates a relative displacement count of 0 through 255 in the history buffer 112; entry 174 has a second prefix value of three bits which indicates that a next following 8 bits indicates a relative displacement count of 256 through 511 in the history buffer 112; entry 176 has a third prefix value of three bits which indicates that a next following 9 bits indicates a relative displacement count of 512 through 1023 in the history buffer 112; entry 178 has a fourth prefix value of three bits which indicates that a next following 10 bits indicates a relative displacement count of 1024 through 2047 in the history buffer 112; entry 180 has a fifth prefix value of three bits which indicates that a next following 11 bits indicates a relative displacement count of 2048 through 4095 in the history buffer 112; and entry 182 has a sixth prefix value of two bits which indicates that a next following 12 bits indicates a relative displacement count of 4096 through 8191 in the history buffer 112.

FIG. 9 illustrates a table 190 comprising an embodiment of the minimum displacement count variable length code table 120 in an embodiment when the minimum consecutive number of bytes is two and when a copy pointer 30 is only used to represent two consecutive bytes if the displacement count in the history buffer 112 is within a predetermined value, such as within the first 1024 values. In table 190, entry 192 has a first prefix value of 1 bit which indicates that a next following 8 bits indicates a relative displacement count of 0 through 255 in the history buffer 112; entry 194 has a second prefix value of two bits which indicates that a next following 8 bits indicates a relative displacement count of 256 through 511 in the history buffer 112; and entry 196 has a third prefix value of two bits which indicates that a next following 9 bits indicates a relative displacement count of 512 through 1023 in the history buffer 112. In certain embodiments to improve compression for a two byte copy pointer, prefix values for data units 0 through 1023 in the displacement count variable length code tables 150 and 170, used to encode all possible displacement counts, has a greater number of bits than the first, second, and third prefix values in the minimum displacement count variable length code table 190 to produce smaller average encodings of the displacement count values for two byte copy pointers 30.

FIG. 10 illustrates a table 200 comprising an embodiment of the match count variable length code table 116 to encode a match count that may indicate a match count of 2 to 271 consecutive bytes (data units) represented by the copy pointer 30. In table 200, entry 202 has a one bit first prefix followed by one bit to represent two or three bytes (data units); entry 204 has a two bit second prefix followed by one bit to represent four or five data units; entry 206 has a three bit third prefix followed by one bit to represent six or seven data units; entry 208 has a four bit fourth prefix followed by one bit to represent eight or nine data units; entry 210 has a five bit fifth prefix followed by one bit to represent ten or eleven data units; entry 212 has a six bit sixth prefix followed by two bits to represent twelve through fifteen data units; entry 214 has a seven bit seventh prefix followed by 3 bits to represent 16 through 23 data units; entry 216 has an eight bit eighth prefix followed by three bits to represent 24 through 31 data units, and entry 218 has an eight bit ninth prefix followed by 8 bits to represent 32 through 271 data units.

FIG. 11 illustrates a table 260 comprising an embodiment of the literal variable length code table 122 to encode a literal displacement count in the literal queue 114 for a literal data symbol 24 to reduce the number of bits likely needed to express the literal value. In table 260, entry 262 has a first prefix value of 1 bit which indicates that a next following six bits indicates one of literal displacement counts 0 through 63; entry 264 has a second prefix value of two bits which indicates that a next following six bits indicates one of literal displacement counts 64 through 127; and entry 266 has a third prefix value of two bits which indicates that a next following 7 bits indicates one of literal displacement counts 128 through 255.

FIG. 12 illustrates a table providing an embodiment of the control symbol table 124 that provides codes or values to output to represent different control symbols.

FIG. 13 illustrates an embodiment of operations performed by the compression program 120 to process an input data stream. Upon initiating the operation to process (at block 300) the input data stream to compress, the compression program 110 sets (at block 302) a current position to a first element in the data stream (data unit or control symbol). If (at block 304) the current position is at a control symbol, then the compression program 110 determines (at block 306) a control symbol value from the control symbol table 124 for the control symbol in the input data stream. The determined control symbol value is output (at block 308) into the output data stream with any pad indicated in the control symbol table 124 for the value.

If (at block 304) the symbol at the current position is a data symbol, then the compression program 110 determines (at block 310) whether there are a number of at least two consecutive data units (bytes) starting at the data unit at the current position which matches the number of consecutive data units in the history buffer 112. If there are consecutive data units from the current position in the input data stream matching consecutive data units in the history buffer 112, then the compression program 110 generates (at block 312) a copy pointer symbol 30 including a copy pointer flag 32, such as a first bit value of 1, indicating the symbol is a copy pointer. The compression program 110 is coded to perform (at block 314) the operations in one of FIG. 14, 15, 16, 17, or 18 to determine an encoding of the relative displacement count in the history buffer 112 at which the consecutive data units start. This encoded displacement count is added to field 36 of the copy pointer symbol 30 (FIG. 5) being generated. The compression program 110 further performs (at block 316) the operations in FIG. 19, using the table in FIG. 1 or the match count variable length code table 116, 200 (FIG. 10), to determine encoding of the match count indicating the number of consecutive bytes starting from the displacement count represented by the copy pointer 30. The encoded match count value is added to field 34 in the copy pointer symbol 30.

If (at block 310) the history does not have a number of consecutive data units matching consecutive data units from the current position, then the compression program 110 generates (at block 318) a literal data symbol 20 including a first bit indicating the symbol is a literal, e.g. zero bit. The compression program 110 is coded to perform operations (at block 320) in one of FIG. 20 or 21 to encode the literal data to include in the literal data symbol 20.

After outputting (at block 322) the generated literal data symbol 20 (from block 320), a copy pointer 30 (from block 316) or control symbol (from block 308), the compression program 110 determines (at block 324) whether there are further elements in the input data stream not encoded and output into the output data stream. If not, control ends. Otherwise, if there are elements to process, the compression program 110 sets (at block 326) the current position to the next unencoded element in the input data stream and proceeds to block 304 to encode further elements to reduce the number of bytes needed to express the data in the input data stream.

As mentioned, FIGS. 14-18 provide different embodiments of operations performed by the compression program 110 for encoding the relative displacement count in the history buffer 112 of the start of the consecutive data units being replaced by the copy pointer 30 in the output data stream.

FIG. 14 provides a prior art technique to determine an absolute displacement count to include in the copy pointer 30. Upon initiating the operation to determine (at block 350) the displacement count 30, the compression program 110 determines (at block 352) an absolute memory address in the memory 108 having the entry in the history buffer 112 with the start of the matching consecutive data units. The determined absolute displacement count, i.e. memory address, is returned (at block 354) to include in the displacement count field 36 of the copy pointer 30.

With respect to FIG. 15, to initiate (at block 370) the operation to determine a relative displacement count into the history buffer 112, the compression program 110 determines (at block 372) a relative displacement count in the history buffer 112 at which the number of matching consecutive data units start. The compression program 110 then determines (at block 374) from the displacement count variable length code table 118 an encoding of the relative displacement count in the history buffer 112 and returns (at block 376) the determined relative displacement count to include in field 36 of the copy pointer symbol 30 (FIG. 5).

FIGS. 16, 17, and 18 provide different embodiments of operations implemented by the compression program 110 to determine whether to generate a copy pointer symbol 30 based on whether the number of consecutive data units to replace is greater than a minimum number of consecutive data units, in order to ensure that using a copy pointer for a minimum number of consecutive data units results in compression benefits. In one embodiment, the minimum number comprises two consecutive bytes.

With respect to FIG. 16, upon initiating (at block 400) the operation to determine the displacement count field 36 in the copy pointer 30, the compression program 110 determines (at block 402) whether the number of consecutive matching data units is a minimum number of consecutive data units. If (at block 402) the number of consecutive data units is greater than the minimum number, then the compression program 110 performs (at block 404) the operations in FIG. 15 to determine encoding of displacement count. If (at block 402) the number of matching consecutive data units is equal to the minimum number, then the compression program 110 determines (at block 406) whether the relative displacement count in the history buffer 12 at which the number of matching consecutive data units start is less than a predetermined displacement count. In certain embodiments, the predetermined displacement count is set to a low enough value to ensure to limit the amount of bits used to express the displacement count encoding 36 so that use of the copy pointer symbol 30 will compress data as opposed to just outputting a literal data symbol 20. For instance, if the minimum number is two bytes, then the predetermined displacement count may comprise 1024, limiting the relative displacement count 36 to ten bits needed to express all 1024 displacement counts.

If (at block 406) the relative displacement count is within the predetermined displacement count, then the compression program 110 indicates (at block 408) in the copy pointer 30 the relative displacement count 36 using a fixed number of bits capable of expressing values up to the predetermined displacement count value, such as 10 bits for a minimum two bytes of consecutive bytes. If (at block 406) the relative displacement count is greater than the predetermined displacement account, then the compression program 110 performs (at block 410) the operations in FIG. 18 or 19 to output the minimum number of consecutive matching data units as literal symbols 20 (FIG. 4).

With respect to FIG. 17, the operations at blocks 450, 452, 454, 456, and 458 are the same as operations 400, 402, 404, 406, and 408, respectively, described with respect to FIG. 16. However, in FIG. 17, if (at block 456) the relative displacement count is not greater than the predetermined displacement account, then the compression program 110 performs (at block 460) the operations in FIG. 18 or 19 to output the first of the minimum number of consecutive matching data units as a literal data symbol 20 and then sets (at block 462) the current position to the second of the minimum number of consecutive data units and return to block 304 in FIG. 10 to consider for the next copy pointer 30 from the new current position.

With respect to FIG. 18, the operations at blocks 500, 502, 504 and 506 are the same as operations 400, 402, 404, and 406, respectively, described with respect to FIG. 16. However, in FIG. 18, if (at block 506) the relative displacement count is greater than the predetermined displacement count, then the compression program 110 determines (at block 508) from the minimum displacement count variable length code table 120, 150, 170 an encoding of the relative displacement count in the history buffer 112. The compression program 110 returns (at block 510) the determined encoding to include in the displacement field 36 of the copy pointer symbol 30 (FIG. 5). If (at block 506) the relative displacement count is not greater than the predetermined displacement count, then the compression program 110 performs (at block 512) the operations in block 410 in FIG. 16 or, alternatively, blocks 460 and 462 in FIG. 17 to output the first and/or following of the minimum number of consecutive matching data units as literals.

In performing the operations in FIG. 15, 16, 17, or 18 if the compression program 110 determines that there are multiple instances of the number of consecutive data units in the history buffer 112 matching the number of the at least two consecutive data units in the input stream, thus providing multiple eligible relative displacement counts in the history buffer 12, then the compression program 110 may select the lowest value relative displacement count to use.

FIG. 19 provide embodiments of operations coded in the compression program 110 to generate an encoding or value for the match count field 34 in the copy pointer symbol 30. With respect to FIG. 19, upon initiating the operation (at block 530) to determine the match count field 34, the compression program 110 uses the Match Count Field Table in FIG. 1 or another match count variable length code table 116, such as table 200 in FIG. 10, to determine the encoding of the match count (number of matching consecutive data units in the history buffer 112). The determined encoding of the match count field is returned (at block 534) to include in the match count field 34 in the copy pointer symbol 30 (FIG. 5) being generated.

FIGS. 20 and 21 provide embodiments of operations coded in the compression program 110 to generate an encoding or value for the literal data symbol 24.

In one embodiment, with respect to FIG. 20, the compression program 110 initiates (at block 540) the operation to generate the literal for the literal data symbol 20 and outputs (at block 542) the unencoded data unit, e.g. byte, in the input data stream to include in the literal data symbol, such as shown in FIG. 2.

In an alternative embodiment, with respect to FIG. 21, the compression program initiates (at block 550) the operation to generate the literal displacement count 24 for the literal data symbol 20 by determining a literal displacement count in the literal queue 114 including the data unit matching the data unit at the current position in the input data stream. The compression program 110 then determines (at block 554) from the literal variable length code table 122 an encoding of the determined literal displacement count to include in the field 24 of the literal data symbol 20 (FIG. 4). If (at block 556) the matching data unit in the literal queue 114 is not at the top, e.g. MRU end, of the literal queue 114, then the compression program 110 moves (at block 558) the matching data unit to the top of the literal queue 114. In one embodiment, the compression program 110 may move the data unit in the literal queue 114 to the top by shifting all bytes ahead of the data unit that matches one so that the matching data unit in the literal queue 114 is overwritten and the matching data unit is then placed at the top of the literal queue 114. After moving the data unit to the top of the literal queue 114 (from block 558) or if the data unit is already at the top of the literal queue 114 (from the yes branch of block 556), the compression program 110 returns (at block 560) the encoding of the literal displacement count to include in the field 24 of the literal data symbol 20 (FIG. 4) being generated.

Described embodiments provide compression techniques to encode fields in a copy pointer, such as the match count field and displacement count and to encode the literal data symbol with a code referencing a location in a literal data queue to realize further improvements in compression of an input data stream.

CONCLUSION

The described operations may be implemented as a method, apparatus or computer program product using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof. Accordingly, aspects of the embodiments may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the embodiments may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

FIG. 22 illustrates an embodiment of a computer architecture 600 that may be implemented at the system 100 in FIG. 1. The architecture 600 may include a processor 602 (e.g. a microprocessor), a memory 604 (e.g. a volatile memory device), and storage 606 (e.g. a non-volatile storage, such as magnetic disk drives, optical disk drives, a tape drive, etc.). The storage 606 may comprise an internal storage device or an attached or network accessible storage. Programs, including an operating system 608 and the compression program 110 and I/O manager 106 in the storage 606 are loaded into the memory 604 and executed by the processor 602. The memory 604 may further include the tables 116, 118, 120, 22, and 124. The architecture further includes a network card 610 to enable communication with a network. An input device 612 is used to provide user input to the processor 602, and may include a keyboard, mouse, pen-stylus, microphone, touch sensitive display screen, or any other activation or input mechanism known in the art. An output device 614 is capable of rendering information transmitted from the processor 602, or other component, such as a display monitor, printer, storage, etc.

The terms “an embodiment”, “embodiment”, “embodiments”, “the embodiment”, “the embodiments”, “one or more embodiments”, “some embodiments”, and “one embodiment” mean “one or more (but not all) embodiments of the present invention(s)” unless expressly specified otherwise.

The terms “including”, “comprising”, “having” and variations thereof mean “including but not limited to”, unless expressly specified otherwise.

The enumerated listing of items does not imply that any or all of the items are mutually exclusive, unless expressly specified otherwise.

The terms “a”, “an” and “the” mean “one or more”, unless expressly specified otherwise.

Devices that are in communication with each other need not be in continuous communication with each other, unless expressly specified otherwise. In addition, devices that are in communication with each other may communicate directly or indirectly through one or more intermediaries.

A description of an embodiment with several components in communication with each other does not imply that all such components are required. On the contrary a variety of optional components are described to illustrate the wide variety of possible embodiments of the present invention.

Further, although process steps, method steps, algorithms or the like may be described in a sequential order, such processes, methods and algorithms may be configured to work in alternate orders. In other words, any sequence or order of steps that may be described does not necessarily indicate a requirement that the steps be performed in that order. The steps of processes described herein may be performed in any order practical. Further, some steps may be performed simultaneously.

When a single device or article is described herein, it will be readily apparent that more than one device/article (whether or not they cooperate) may be used in place of a single device/article. Similarly, where more than one device or article is described herein (whether or not they cooperate), it will be readily apparent that a single device/article may be used in place of the more than one device or article or a different number of devices/articles may be used instead of the shown number of devices or programs. The functionality and/or the features of a device may be alternatively embodied by one or more other devices which are not explicitly described as having such functionality/features. Thus, other embodiments of the present invention need not include the device itself.

The illustrated operations of FIGS. 13-21 show certain events occurring in a certain order. In alternative embodiments, certain operations may be performed in a different order, modified or removed. Moreover, steps may be added to the above described logic and still conform to the described embodiments. Further, operations described herein may occur sequentially or certain operations may be processed in parallel. Yet further, operations may be performed by a single processing unit or by distributed processing units.

The foregoing description of various embodiments of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto. The above specification, examples and data provide a complete description of the manufacture and use of the composition of the invention. Since many embodiments of the invention can be made without departing from the spirit and scope of the invention, the invention resides in the claims herein after appended. 

1-22. (canceled)
 23. A computer program product for compressing an input data stream to produce a compressed output data stream, the computer program product comprising a computer readable storage medium having computer readable program code embodied therein that executes to perform operations, the operations comprising: determining consecutive data units in the input data stream that match consecutive data units in a history buffer; generating a copy pointer symbol referencing previously received data units in the history buffer; determining whether a number of consecutive data units that match in the history buffer exceed a minimum number of consecutive data units; including an encoding of a relative displacement count in the copy pointer in response to determining that the number of consecutive data units that match exceeds the minimum number; and including literal data for the consecutive data units in the copy pointer in response to determining that the number of consecutive data units that match exceeds the minimum number.
 24. The computer program product of claim 23, wherein the operations further comprise: indicating in the copy pointer a number of the determined consecutive data units in the input data stream that match the consecutive data units in the history buffer.
 25. The computer program product of claim 23, wherein the encodings of the relative displacement counts include a prefix indicating a number of following bits used to indicate the relative displacement count in the history buffer where the consecutive data units start.
 26. The computer program product of claim 23, wherein the operations further comprise: determining whether the number of the matching consecutive data units in the history buffer is the minimum number; determining whether the relative displacement count in the history buffer at which the number of matching consecutive data units start is less than a predetermined displacement count in response to determining that the number comprises the minimum number; indicating in the copy pointer symbol the relative displacement count using a fixed number of bits capable of representing displacement count values up to the predetermined displacement count in response to determining that the number comprises the minimum number and the relative displacement count is less than the predetermined displacement count; wherein the operations of determining the range, determining the encoding scheme, determining the encoding of the displacement count and indicating the determined encoding of the displacement count in the copy pointer symbol are performed in response to determining that the number of the matching consecutive data units is more than the minimum number.
 27. The computer program product of claim 23, wherein the including the literal data for the consecutive data units in the copy pointer comprises generating a literal data symbol including a bit indicating the symbol is a literal and outputting unencoded data unit in the literal data symbol.
 28. The computer program product of claim 23, wherein a literal queue includes uncompressed data units in the input data stream, wherein the including the literal data for the consecutive data units in the copy pointer comprises: determining a literal displacement count in the literal queue including the data unit matching the data unit in the input data stream; determining an encoding of the determined literal displacement count; and including the encoded determined literal displacement count in the literal symbol.
 29. The computer program product of claim 28, wherein the operations further comprises: determining whether the matching data unit is at a most recently used end of the literal queue; and moving the matching data unit to the MRU end of the literal queue in response to determining that the matching data unit is not at the MRU end.
 30. A system for compressing an input data stream to produce a compressed output data stream, comprising: a compression unit including a compression program executed to perform operations, the operations comprising: determining consecutive data units in the input data stream that match consecutive data units in a history buffer; generating a copy pointer symbol referencing previously received data units in the history buffer; determining whether a number of consecutive data units that match in the history buffer exceed a minimum number of consecutive data units; including an encoding of a relative displacement count in the copy pointer in response to determining that the number of consecutive data units that match exceeds the minimum number; and including literal data for the consecutive data units in the copy pointer in response to determining that the number of consecutive data units that match exceeds the minimum number.
 31. The system of claim 30, wherein the operations further comprise: indicating in the copy pointer a number of the determined consecutive data units in the input data stream that match the consecutive data units in the history buffer.
 32. The system of claim 30, wherein the encodings of the relative displacement counts include a prefix indicating a number of following bits used to indicate the relative displacement count in the history buffer where the consecutive data units start.
 33. The system of claim 30, wherein the operations further comprise: determining whether the number of the matching consecutive data units in the history buffer is the minimum number; determining whether the relative displacement count in the history buffer at which the number of matching consecutive data units start is less than a predetermined displacement count in response to determining that the number comprises the minimum number; indicating in the copy pointer symbol the relative displacement count using a fixed number of bits capable of representing displacement count values up to the predetermined displacement count in response to determining that the number comprises the minimum number and the relative displacement count is less than the predetermined displacement count; wherein the operations of determining the range, determining the encoding scheme, determining the encoding of the displacement count and indicating the determined encoding of the displacement count in the copy pointer symbol are performed in response to determining that the number of the matching consecutive data units is more than the minimum number.
 34. The system of claim 30, wherein the including the literal data for the consecutive data units in the copy pointer comprises generating a literal data symbol including a bit indicating the symbol is a literal and outputting unencoded data unit in the literal data symbol.
 35. The system of claim 30, wherein a literal queue includes uncompressed data units in the input data stream, wherein the including the literal data for the consecutive data units in the copy pointer comprises: determining a literal displacement count in the literal queue including the data unit matching the data unit in the input data stream; determining an encoding of the determined literal displacement count; and including the encoded determined literal displacement count in the literal symbol.
 36. The system of claim 35, wherein the operations further comprises: determining whether the matching data unit is at a most recently used end of the literal queue; and moving the matching data unit to the MRU end of the literal queue in response to determining that the matching data unit is not at the MRU end.
 37. A method for compressing an input data stream to produce a compressed output data stream, comprising: determining consecutive data units in the input data stream that match consecutive data units in a history buffer; generating a copy pointer symbol referencing previously received data units in the history buffer; determining whether a number of consecutive data units that match in the history buffer exceed a minimum number of consecutive data units; including an encoding of a relative displacement count in the copy pointer in response to determining that the number of consecutive data units that match exceeds the minimum number; and including literal data for the consecutive data units in the copy pointer in response to determining that the number of consecutive data units that match exceeds the minimum number.
 38. The method of claim 37, wherein further comprising: indicating in the copy pointer a number of the determined consecutive data units in the input data stream that match the consecutive data units in the history buffer.
 39. The method of claim 37, wherein the encodings of the relative displacement counts include a prefix indicating a number of following bits used to indicate the relative displacement count in the history buffer where the consecutive data units start.
 40. The method of claim 37, further comprising: determining whether the number of the matching consecutive data units in the history buffer is the minimum number; determining whether the relative displacement count in the history buffer at which the number of matching consecutive data units start is less than a predetermined displacement count in response to determining that the number comprises the minimum number; indicating in the copy pointer symbol the relative displacement count using a fixed number of bits capable of representing displacement count values up to the predetermined displacement count in response to determining that the number comprises the minimum number and the relative displacement count is less than the predetermined displacement count; wherein the operations of determining the range, determining the encoding scheme, determining the encoding of the displacement count and indicating the determined encoding of the displacement count in the copy pointer symbol are performed in response to determining that the number of the matching consecutive data units is more than the minimum number.
 41. The method of claim 37, wherein the including the literal data for the consecutive data units in the copy pointer comprises generating a literal data symbol including a bit indicating the symbol is a literal and outputting unencoded data unit in the literal data symbol.
 42. The method of claim 37, wherein a literal queue includes uncompressed data units in the input data stream, wherein the including the literal data for the consecutive data units in the copy pointer comprises: determining a literal displacement count in the literal queue including the data unit matching the data unit in the input data stream; determining an encoding of the determined literal displacement count; and including the encoded determined literal displacement count in the literal symbol.
 43. The method of claim 42, further comprising: determining whether the matching data unit is at a most recently used end of the literal queue; and moving the matching data unit to the MRU end of the literal queue in response to determining that the matching data unit is not at the MRU end. 